Ostrowski-Like Method for the Inclusion of a Single Complex Polynomial Zero
نویسندگان
چکیده
A new iterative method of Ostrowski’s type for the inclusion of one isolated simple or multiple complex zero of a polynomial is established in circular complex arithmetic. Cubic convergence is proved and computationally verifiable initial condition that guarantees the convergence of this inclusion method is stated. In order to demonstrate convergence behavior of the proposed method, two numerical examples are given.
منابع مشابه
Improvement of Convergence Condition of the Square-root Interval Method for Multiple Zeros
A new theorem concerned with the convergence of the Ostrowski-like method for the simultaneous inclusion of multiple complex zeros in circular complex arithmetic is established. Computationally verifiable initial condition that guarantees the convergence of this parallel inclusion method is significantly relaxed compared with the classical theorem stated in [Z. Angew. Math. Mech. 62 (1982), 627...
متن کاملSolving Single Phase Fluid Flow Instability Equations Using Chebyshev Tau- QZ Polynomial
In this article the instability of single phase flow in a circular pipe from laminar to turbulence regime has been investigated. To this end, after finding boundary conditions and equation related to instability of flow in cylindrical coordination system, which is called eigenvalue Orr Sommerfeld equation, the solution method for these equation has been investigated. In this article Chebyshev p...
متن کاملOn the Newton-like Method for the Inclusion of a Polynomial Zero
One of the most important problems in solving nonlinear equations is the construction of such initial conditions which provide both the guaranteed and fast convergence of the considered numerical algorithms. In this paper we study an iterative method of Newton’s type for the inclusion of isolated complex zero of a given polynomial. We state computationally verifiable initial condition for the c...
متن کاملThe Improved Square-root Methods for the Inclusion of Multiple Zeros of Polynomials
Starting from a fixed point relation, we construct very fast iterative methods of Ostrowski-root’s type for the simultaneous inclusion of all multiple zeros of a polynomial. The proposed methods possess a great computational efficiency since the acceleration of the convergence is attained with only a few additional calculations. Using the concept of the R-order of convergence of mutually depend...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 16 شماره
صفحات -
تاریخ انتشار 2012